Distributed simulation performance data mining

نویسندگان

  • Alois Ferscha
  • James Johnson
  • Stephen John Turner
چکیده

The performance of logical process based distributed simulation (DS) protocols like Time Warp and Chandy/Misra/Bryant is influenced by a variety of factors such as the event structure underlying the simulation model, the partitioning into submodels, the performance characteristics of the execution platform, the implementation of the simulation engine and optimizations related to the protocols. The mutual performance effects of parameters exhibit a prohibitively complex degree of interweaving, giving analytical performance investigations only relative relevance. Nevertheless, performance analysis is of utmost practical interest for the simulationist who wants to decide on the suitability of a certain DS protocol for a specific simulation model before substantial efforts are invested in developing sophisticated DS codes. Since DS performance prediction based on analytical models appears doubtful with respect to adequacy and accuracy, this work presents a prediction method based on the simulated execution of skeletal implementations of DS protocols. Performance data mining methods based on statistical analysis and a simulation tool for DS protocols have been developed for DS performance prediction, supporting the simulationist in three types of decision problems: (i) given a simulation problem and parallel execution platform, which DS protocol promises best performance, (ii) given a simulation model and a DS strategy, which execution platform is appropriate from the performance viewpoint, and (iii) what class of simulation models is best executed on a given multiprocessor using a certain DS protocol. Methodologically, skeletons of the most important variations of DS protocols are developed and executed in the N-MAP performance prediction environment. As a mining technique, performance data is collected and analyzed based on a full factorial design. The design predictor variables are used to explain DS performance. © 2001 Elsevier Science B.V. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distributed Incremental Least Mean-Square for Parameter Estimation using Heterogeneous Adaptive Networks in Unreliable Measurements

Adaptive networks include a set of nodes with adaptation and learning abilities for modeling various types of self-organized and complex activities encountered in the real world. This paper presents the effect of heterogeneously distributed incremental LMS algorithm with ideal links on the quality of unknown parameter estimation. In heterogeneous adaptive networks, a fraction of the nodes, defi...

متن کامل

A Study of Distributed Clustering of Vector Time Series on the Grid by Task Farming

Traditional data mining methods were limited by availability of computing resources like network bandwidth, storage space and processing power. These algorithms were developed to work around this problem by looking at a small cross-section of the whole data available. However since a major chunk of the data is kept out, the predictions were generally inaccurate and missed out on significant fea...

متن کامل

A Survey on MapReduce Performance and Hadoop Acceleration

MapReduce is implementation for generating large data sets with a parallel, distributed algorithm on a cluster. Hadoop is open source implementation of the MapReduce programming datamodel used for large-scale parallel applications such as web indexing, data mining, and scientific simulation. Hadoop-A framework is able to levitate Hadoop acceleration and give significant performance compared to ...

متن کامل

Context-based Distributed Regression in Virtual Organizations

The characteristics of virtual organizations present significant challenges to both distributed data mining methods within a metalearning framework and statistical multi-level models. Using hierarchical models, this paper explicitly address the context heterogeneity existing across the partners of virtual organizations. Two new approaches of context-based distributed data mining are analyzed an...

متن کامل

Performance Mining of Large-Scale Data-Intensive Applications

Next generation distributed object systems will be required to support millions if not billions of objects and to persist for long periods of time, such as a simulation of the entire World Web Web or modeling of protein folding. If these complex object systems are to be scalable and run effectively throughout the life-cycle, support is required to share new knowledge, to store existing knowledg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Future Generation Comp. Syst.

دوره 18  شماره 

صفحات  -

تاریخ انتشار 2001